منابع مشابه
Some Infinite Classes of Fullerene Graphs
A fullerene graph is a 3 regular planar simple finite graph with pentagon or hexagon faces. In these graphs the number of pentagon faces is 12. Therefore, any fullerene graph can be characterized by number of its hexagon faces. In this note, for any h > 1, we will construct a fullerene graph with h hexagon faces. Then, using the leapfrogging process we will construct stable fullerenes with 20 +...
متن کامل4-Prime cordiality of some classes of graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملSome Infinite Classes of Hadamard Matrices
A recursive method of A. C. Mukhopadhay is used to obtain several new infinite classes of Hadamard matrices. Unfortunately none of these constructions give previously unknown Hadamard matrices of order <40,000. Disciplines Physical Sciences and Mathematics Publication Details Seberry, J, Some infinite families of Hadamard matrices, J Austral Math Soc, Ser. A, 29, 1980, 235-242. This journal art...
متن کاملSome Effectively Infinite Classes of Enumerations
Goncharov, S., A. Yakhnis and V. Yakhnis, Some effectively infinite classes of enumerations, Annals of Pure and Applied Logic 60 (1993) 207-235. This research partially answers the question raised by Goncharov about the size of the class of positive elements of a Roger’s semilattice. We introduce a notion of effective infinity of classes of computable enumerations. Then, using finite injury pri...
متن کاملBicolored matchings in some classes of graphs
Given a graph G = (V,E) and a set P = {po, p1, . . . , ps} of integers 0 ≤ po < p1 < . . . < ps ≤ b|V |/2c, we want to color a subset R ⊆ E of edges of G, say in red, in such a way that for any i (0 ≤ i ≤ s) G contains a maximum matching Mi with exactly pi red edges, i.e., |Mi ∩ R| = pi. We shall in particular be interested in finding a smallest subset R for which the required maximum matchings...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2006
ISSN: 1314-7536
DOI: 10.12988/imf.2006.06177